Planning in Cost-Paired Markov Decision Process Games
نویسندگان
چکیده
We describe applications and theoretical results for a new class of two-player planning games. In these games, each player plans in a separate Markov Decision Process (MDP), but the costs associated with a policy in one of the MDPs depend on the policy selected by the other player. These costpaired MDPs represent an interesting and computationally tractable subset of adversarial planning problems. To solve them, we extend the Double Oracle Algorithm of [3].
منابع مشابه
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a robot path planning problem where costs are influenced by sensors that an adversary places in the environment. We formulate the problem as a zero-sum matrix game where rows correspond to deterministic policies for the pla...
متن کاملOptimizing Red Blood Cells Consumption Using Markov Decision Process
In healthcare systems, one of the important actions is related to perishable products such as red blood cells (RBCs) units that its consumption management in different periods can contribute greatly to the optimality of the system. In this paper, main goal is to enhance the ability of medical community to organize the RBCs units’ consumption in way to deliver the unit order timely with a focus ...
متن کاملCAPIR: Collaborative Action Planning with Intention Recognition
We apply decision theoretic techniques to construct nonplayer characters that are able to assist a human player in collaborative games. The method is based on solving Markov decision processes, which can be difficult when the game state is described by many variables. To scale to more complex games, the method allows decomposition of a game task into subtasks, each of which can be modelled by a...
متن کاملLearning What to Talk about in Descriptive Games
Text generation requires a planning module to select an object of discourse and its properties. This is specially hard in descriptive games, where a computer agent tries to describe some aspects of a game world. We propose to formalize this problem as a Markov Decision Process, in which an optimal message policy can be defined and learned through simulation. Furthermore, we propose back-off pol...
متن کاملConstrained Markov Games: Nash Equilibria
In this paper we develop the theory of constrained Markov games. We consider the expected average cost as well as discounted cost. We allow diierent players to have different types of costs. We present suucient conditions for the existence of stationary Nash equilibrium. Our results are based on the theory of sensitivity analysis of mathematical programs developed by Dantzig, Folkman and Shapir...
متن کامل